Fuzzy programming for multi-choice bilevel transportation problem
نویسندگان
چکیده
Multi-choice programming problems arise due to diverse needs of people. In this paper, multi-choice optimisation is applied bilevel transportation problem. This problem deals with at both the levels, upper as well lower. There are multiple choices for demand and supply parameters. The parameters respective levels converted into polynomials which transmute defined a mixed integer objective paper determine solution methodology transformed significance formulated model exhibited through an example by applying it hotel industry. fuzzy programing approach employed obtain satisfactory decision makers two levels. A comparative analysis presented in solving goal mode linear transformation technique proposed Khalil et al. solved using computing software.
منابع مشابه
Multi-choice stochastic bi-level programming problem in cooperative nature via fuzzy programming approach
In this paper, a Multi-Choice Stochastic Bi-Level Programming Problem (MCSBLPP) is considered where all the parameters of constraints are followed by normal distribution. The cost coefficients of the objective functions are multi-choice types. At first, all the probabilistic constraints are transformed into deterministic constraints using stochastic programming approach. Further, a general tran...
متن کاملA New Method For Solving Linear Bilevel Multi-Objective Multi-Follower Programming Problem
Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has sev...
متن کاملSimulated Annealing Approach for Solving Bilevel Programming Problem
Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research and Decisions
سال: 2021
ISSN: ['1230-1868', '2391-6060', '2081-8858']
DOI: https://doi.org/10.37190/ord210301